package leetcode.biweekly.week98;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

//Solution3Test
public class Solution3 {
	public int minImpossibleOR(int[] nums) {
		Set<Integer> set = new HashSet<>();
		for (int i = 0; i < nums.length; i++) {
			set.add(nums[i]);
		}
		int ans = 1;
		while (set.contains(ans)) {
			ans <<= 1;
		}
		return ans;
	}

}
